A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices
نویسندگان
چکیده
This work presents a new algorithm based on the Bucket Elimination framework that efficiently determines strong controllability of temporal plans formulated as Labeled Simple Temporal Networks with Uncertainty (LSTNU) with controllable and uncontrollable plan branches (choices).
منابع مشابه
Solving Temporal Problems Using SMT: Strong Controllability
Many applications, such as scheduling and temporal planning, require the solution of Temporal Problems (TP’s) representing constraints over the timing of activities. A TP with uncertainty (TPU) is characterized by activities with uncontrollable duration. Depending on the Boolean structure of the constraints, we have simple (STPU), constraint satisfaction (TCSPU), and disjunctive (DTPU) temporal...
متن کاملWorkshop on Multiagent Planning and Scheduling
In most real world situations, cooperative multi-agent plans will contain activities that are not under direct control by the agents. In order to enable the agents to robustly adapt to this temporal uncertainty, the agents must be able to communicate at execution time in order to dynamically schedule their plans. However, it is often undesirable or impossible to maintain communication between a...
متن کاملRobust Execution of Plans for Human-Robot Teams
Humans and robots working together can efficiently complete tasks that are very difficult for either to accomplish alone. To collaborate fluidly, robots must recognize the humans’ intentions and adapt to their actions appropriately. Pike is an online executive introduced previously in the literature that unifies intent recognition and plan adaptation for temporally flexible plans with choice. W...
متن کاملResolving Uncontrollable Conditional Temporal Problems Using Continuous Relaxations
Uncertainty is commonly encountered in temporal scheduling and planning problems, and can often lead to over-constrained situations. Previous relaxation algorithms for over-constrained temporal problems only work with requirement constraints, whose outcomes can be controlled by the agents. When applied to uncontrollable durations, these algorithms may only satisfy a subset of the random outcome...
متن کاملChance-Constrained Strong Controllability of Temporal Plan Networks with Uncertainty
This works presents a novel approach for determining chance-constrained strong controllability of Temporal Plan Networks with Uncertainty (TPNU) by framing it as an Optimal Satisfiability Problem (OpSAT).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012